Ant Algorithm for Flow Assignment in Connection-oriented Networks
نویسنده
چکیده
This work introduces ANB (Ant Algorithm for Non-Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.
منابع مشابه
Spectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants
The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...
متن کاملApplication of Ant Colony Optimization to the Routing and Wavelength Assignment Problem
Title of Document: APPLICATION OF ANT COLONY OPTIMIZATION TO THE ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM Eunmi Kim, Masters of Science, August 2007 Directed By: Associate Professor, Dr. Richard J. La, Department of Electrical and Computer Engineering The transmission capacity of a link in today’s optical networks has increased significantly due to wavelength-division multiplexing (WDM) techno...
متن کاملAnt-Based Alternate Routing in All-Optical WDM Networks
We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-divisionmultiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants’ foraging. The P-route table contains P alternate routes...
متن کاملDynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting a new routing table structure and keeping a number of ants in the network to cooperatively explore the network states and continuously update the routing tables, our new ant algorithm can efficiently support the ants...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کامل